Solving the Multi-Resource Bin Packing Problem with a Reordering Grouping Genetic Algorithm
ثبت نشده
چکیده
We formally define multi-resource bin packing, a generalization of conventional bin packing, and develop an algorithm called Reordering Grouping Genetic Algorithm (RGGA) to solve this problem. Multi-resource bin packing can be applied to different problems, such as placing virtual machines onto servers. We first test RGGA on conventional bin packing problems and show that it yields excellent results but much more efficiently. We then generate a multi-constraint test set, not solvable by current methods, and demonstrate the effectiveness of RGGA in this context.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کاملMulti-level Grouping Genetic Algorithm for Low Carbon Virtual Private Clouds
Optimization problem of physical servers consolidation is very important for energy efficiency and cost reduction of data centers. For this type of problems, which can be considered as bin-packing problems, traditional heuristic algorithms such as Genetic Algorithm (GA) are not suitable. Therefore, other heuristic algorithms are proposed instead, such as Grouping Genetic Algorithm (GGA), which ...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملA general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
A class of problems referred to as Order Independent Minimum Grouping Problems is examined and an intuitive hill-climbing method for solving such problems is proposed. Example applications of this generic method are made to two well-known problems belonging to this class: graph colouring and bin packing. Using a wide variety of different problem instance-types, these algorithms are compared to ...
متن کامل